Voting Theory in Answer Set Programming

In this paper, we combine answer set programming with voting theory for the first time. For this, we use the voting procedures defined in [5], which allow winner determination under incomplete preference relations. We present the problem of scheduling a meeting for a research group as an application. In those scheduling problems, often no meetings are schedulable because of conflicting unavailabilities of the attendees or multiple dates for meetings are possible, where one has to respect the preferences of the attendees. In the first case, we provide a diagnostic model analyzing why no meeting was schedulable. In the second case, we use voting procedures for incomplete preference relations to determine preferred meetings.